The Kadec-Pełczyński theorem in $L^p$, $1\le p<2$

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Replacement Theorem For LP

The replacement theorem for classical and normal modal logics is a fundamental tool. It says that if A and B have been proved equivalent, occurrences of A in a formula may be replaced with occurrences of B to produce a formula equivalent to the original one. This theorem does not hold for LP, Logic of Proofs. A replacement for replacement is not simple to formulate. In this note I have provided...

متن کامل

AN LP-LQ-VERSION OF MORGAN’S THEOREM FOR THE GENERALIZED BESSEL TRANSFORM

n this article, we prove An Lp-Lq-version of Morgan’s theorem for the generalized Bessel transform.

متن کامل

Double-null operators and the investigation of Birkhoff's theorem on discrete lp spaces

Doubly stochastic matrices play a fundamental role in the theory of majorization. Birkhoff's theorem explains the relation between $ntimes n$ doubly stochastic matrices and permutations. In this paper, we first introduce double-null  operators and we will find some important properties of them. Then with the help of double-null operators, we investigate Birkhoff's theorem for descreate $l^p$ sp...

متن کامل

TR-2006002: A Replacement Theorem for LP

The replacement theorem for classical and normal modal logics is a fundamental tool. It says that if A and B have been proved equivalent, occurrences of A in a formula may be replaced with occurrences of B to produce a formula equivalent to the original one. This theorem does not hold for LP, Logic of Proofs. A replacement for replacement is not simple to formulate. In this note I have provided...

متن کامل

Lp-INVERSE THEOREM FOR MODIFIED BETA OPERATORS

and B(v+1,n) being the beta function (see, e.g., [3]). It is easily verified that the operators Bn are linear positive operators. Also, Bn(1,x) = 1. It turns out that the order of approximation for the operators (1.1) is at best O(n−1) howsoever smooth the function may be. With the aim of improving the order of approximation, we have to slack the positive condition of these operators for which ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 2015

ISSN: 0002-9939,1088-6826

DOI: 10.1090/proc/12872